A Distinguisher for High-Rate McEliece Cryptosystems
نویسندگان
چکیده
منابع مشابه
A Distinguisher for High Rate McEliece Cryptosystem
The purpose of this talk is to study the difficulty of the Goppa Code Distinguishing (GD) problem, which is the problem of distinguishing the public matrix in the McEliece cryptosystem from a random matrix. It is widely believed that this problem is computationally hard as proved by the increasing number of papers using this hardness assumption. One can consider that disproving/mitigating this ...
متن کاملSemantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
Almost all of the current public-key cryptosystems (PKCs) are based on number theory, such as the integer factoring problem and the discrete logarithm problem (which will be solved in polynomial-time after the emergence of quantum computers). While the McEliece PKC is based on another theory, i.e. coding theory, it is vulnerable against several practical attacks. In this paper, we carefully rev...
متن کاملPunctured Reed-Muller code-based McEliece cryptosystems
The authors propose new McEliece cryptosystems based on punctured Reed–Muller (RM) codes. They successfully show that the commonly known attacks, such as the Minder–Shokrollahi attack, the Chizhov–Borodin attack, and the square code attack, are ineffective against the proposed RM code-based McEliece cryptosystem. We developed an optimal puncturing scheme to prevent the above-mentioned attacks f...
متن کاملProtograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems
In this paper, ensembles of quasi-cyclic moderatedensity parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem. The proposed ensembles significantly improve the error correction capability of the regular MDPC code ensembles that are currently considered for post-quantum cryptosystems without increasing the public key size. The ...
متن کاملCryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers subcodes of a primitive BCH code. The aforementioned constraint on the public and secret keys implies to choose very structured permutations. We prove that thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2272036